Discovering Latent Association Structure via Bayesian one-mode Projection of Temporal Bipartite Graphs
نویسندگان
چکیده
We propose an extension to the notion of one-mode projection, for the case of temporal bipartite graphs. Through a Bayesian iterative update scheme, our method produces an estimate of the one-mode network at each step, by describing each link via probability distributions over i) its presence/absence and ii) weight. Our approach models the statistical significance of each link in the projected network, avoids overfitting and naturally handles noise and missing observations via probabilistic outputs.
منابع مشابه
Bayesian one-mode projection for dynamic bipartite graphs
We propose a Bayesian methodology for one-mode projecting a bipartite network that is being observed across a series of discrete time steps. The resulting one mode network captures the uncertainty over the presence/absence of each link and provides a probability distribution over its possible weight values. Additionally, the incorporation of prior knowledge over previous states makes the result...
متن کاملLatent geometry of bipartite networks
Despite the abundance of bipartite networked systems, their organizing principles are less studied compared to unipartite networks. Bipartite networks are often analyzed after projecting them onto one of the two sets of nodes. As a result of the projection, nodes of the same set are linked together if they have at least one neighbor in common in the bipartite network. Even though these projecti...
متن کاملCommunity Structures in Bipartite Networks: A Dual-Projection Approach
Identifying communities or clusters in networked systems has received much attention across the physical and social sciences. Most of this work focuses on single layer or one-mode networks, including social networks between people or hyperlinks between websites. Multilayer or multi-mode networks, such as affiliation networks linking people to organizations, receive much less attention in this l...
متن کاملDiscovering Hidden Variables in Noisy-Or Networks using Quartet Tests
We give a polynomial-time algorithm for provably learning the structure and parameters of bipartite noisy-or Bayesian networks of binary variables where the top layer is completely hidden. Unsupervised learning of these models is a form of discrete factor analysis, enabling the discovery of hidden variables and their causal relationships with observed data. We obtain an efficient learning algor...
متن کاملBounding cochordal cover number of graphs via vertex stretching
It is shown that when a special vertex stretching is applied to a graph, the cochordal cover number of the graph increases exactly by one, as it happens to its induced matching number and (Castelnuovo-Mumford) regularity. As a consequence, it is shown that the induced matching number and cochordal cover number of a special vertex stretching of a graph G are equal provided G is well-covered bipa...
متن کامل